Generic Density and Small Span Theorem
نویسنده
چکیده
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E-computable real in [0, 1], and show a relationship between generic density and Lutz resource bounded dimension. We also introduce strong generic density, and show that it is related to packing dimension. We show that all four notions are different. We show that whereas dimension notions depend on the underlying probability measure, generic density does not, which implies that every dimension result proved by generic density arguments, simultaneously holds under any (biased coin based) probability measure. We prove such a result: we improve the small span theorem of Juedes and Lutz, to the packing dimension setting, for k-bounded-truthtable reductions, under any (biased coin) probability measure.
منابع مشابه
Genericity and Measure for Exponential Time1
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quantitative structure of Exponential Time (E=DTIME (2lin)). Previously, Ambos-Spies, Fleischhack and Huwig [2,3] introduced polynomial time bounded genericity concepts and used them for the investigation of structural pr...
متن کاملBone Mineral Density and Cystic Fibrosis: A Review
Cystic fibrosis (CF) is a common progressive genetic disorder among children which involves lungs, kidneys, intestine and liver. Apart from the significance of genetic factors, various environmental factors particularly bone mineral density are directly associated with CF. Remarkably, bone disease is appeared as a routine and commo...
متن کاملA Small Span Theorem within P
The development of Small Span Theorems for various complexity classes and re ducibilities plays a basic role in resource bounded measure theoretic investigations of e cient reductions A Small Span Theorem for a complexity class C and reducibil ity r is the assertion that for all sets A in C at least one of the cones below or above A is a negligible small class with respect to C where the cones ...
متن کاملA Small Span Theorem for P/Poly-Turing Reductions
This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits P Poly Turing reductions A Small Span Theorem is proven for such reductions This result says that every language A in ESPACE satis es at least one of the following two conditions i The lower P Poly Turing span of A consisting of all languages that are P Poly Turing red...
متن کاملLocal Density In Graphs With Forbidden Subgraphs
A celebrated theorem of Turán asserts that every graph on n vertices with more than r− 1 2r n 2 edges contains a copy of a complete graph Kr+1. In this paper we consider the following more general question. Let G be a Kr+1-free graph of order n and let α be a constant, 0 < α 1. How dense can every induced subgraph of G on αn vertices be? We prove the following local density extension of Turán’s...
متن کامل